1. INTRODUCTION:

MANET [1] is a wireless network having mobile nodes with no fixed infrastructure. These kinds Of networks are used in areas such as environmental monitoring or in rescue operations. The main limitation of ad-hoc systems is the availability of power. In addition to running the onboard electronics, power consumption is governed by the number of processes and overheads required to maintain connectivity [6]. This paper aims to find out an energy efficient routing protocol. The need for energy efficiency is a problem that derives from the constraints imposed by battery capacity and heat dissipation which are opposed by the desire for miniaturization and portability. Battery technology and technologies for heat removal have traditionally improved at a slower pace compared with the increasing computation expected and the decreasing size of wireless terminals.

The way out is energy efficiency: doing more work per unit of battery energy consumed and heat dissipated. Energy efficiency in future wireless terminals will be at the higher levels: low-energy protocols, context dependent, predictive shutdown management and changed terminal-network functional partitioning will be used to reduce computation done at the terminal.

In order to provide communication throughout the network, the mobile nodes must cooperate to handle network functions, such as packet routing. The wireless mobile hosts communicate in a multi-hop fashion. In multi-hop wireless ad-hoc networks, designing energy-efficient routing protocols is critical since nodes have very limited energy, computing power and communication capabilities. For such protocols to scale to larger ad-hoc networks, localized algorithms need to be proposed that completely depend on local information. Mobile ad hoc network having the various type of protocols such as reactive proactive and hybrid. Here we described the different type of MANET routing protocols based upon the communication over the dynamic environment. In this paper we measurement of energy consumption effect of different type of routing protocols like AODV, DSR, DSDV, and mainly constraint on TORA, these protocols selected on the basis of their performance on energy effect .hear we select the various parameter for network simulator are: A) MAC load B) Throughput C) Energy Consumption per Packet D) Remaining Battery Power.

1.1 Routing Protocols in MANET:

Proactive (Table-Driven) Routing Protocols:

The advantage of these protocols is that a source node does not need route-discovery actions to find a route to a destination node. On the other factor that the drawback of these protocols is maintaining a dependable and up-to-date routing table requires substantial messaging overhead, which consumes bandwidth and power, and decreases throughput, especially in the case of a large number of high node mobility. This type of protocols, nodes keep one or more routing tables about nodes in the network. These routing protocols update the routing table information either periodically or in response to change in the network topology.

Reactive (On-Demand) Routing Protocols:

In this type of protocols is an initialization of a route discovery mechanism by the source node to the destination node to find the route when the source node has data packets to send. When a route is found, the route maintenance is initiated to maintain this route until it is no longer required or the destination is not reachable. The advantage of these protocols is that overhead messaging is reduced. One of the drawbacks of these protocols is the delay in discovering a new route. The different types of reactive routing protocols are: Dynamic Source Routing (DSR) Ad-hoc On-Demand Distance Vector routing (AODV) and Temporally Ordered Routing Algorithm (TORA). Hybrid Protocols Hybrid protocols are the combinations of reactive and proactive protocols and it takes advantages of both the protocols and as a result, routes are found quickly in the routing zone. ZRP, GRP etc.

2. DESCRIPTION OF SELECTED PROTOCOLS:

In this section, a brief description of the routing operations performed by the familiar protocols. OLSR, AODV, DSR and TORA are discussed

2.1 Ad Hoc On-demand Distance Vector Routing (AODV) protocol:

The Ad Hoc On-demand Distance Vector Routing (AODV) [8] protocol is a reactive unicast routing protocol for mobile ad hoc networks. As a reactive routing protocol, AODV only needs to maintain the routing information about the active paths. In AODV, the routing information is maintained in the routing tables at all the nodes. Every mobile node keeps a next hop routing table, which contains the destinations to which it currently has a route. A routing table entry expires if it has not been used or reactivated for a pre-specified expiration time. In AODV, when a source node wants to send packets to the destination but no route is available, it initiates a route discovery operation. In the route discovery operation, the source node broadcasts route request (RREQ) packets which includes Destination Sequence Number. When the destination or a node that has a route to the destination receives the RREQ, it checks the destination sequence numbers it currently knows and the one specified in the RREQ. To guarantee the freshness of the routing information, a route reply (RREP) packet is created and forwarded back to the source only if the destination sequence number is equal to or greater than the one specified in RREQ. AODV uses only symmetric links and a RREP follows the reverse path of the respective RREQ. Upon receiving the RREP packet, each intermediate node along the route updates its next-hop table entries with respect to the destination node. The redundant RREP packets or RREP packets with lower destination sequence number will be dropped. The advantage of this protocol is low Connection setup delay and the disadvantage is more number of control overheads due to many route reply messages for single route request.

2.2 Dynamic Source Routing (DSR) protocol:

Dynamic Source Routing (DSR) [9] protocol is a reactive, on demand routing protocol based on the source routing. The source routing irrelevantly allows routing of packets to be loop-free, avoids the need for up-to-date routing information in between nodes and allows nodes that overhear packets containing routes to cache this information for their own future use. A node that needs to send a packet to a destination checks in its route cache if it has a route available. In a route discovery phase, a node sends the route request to the destination node. It responds by the route reply than a path is established between the source and destination. Route maintenance indicates that the source route is broken; it can prefer another route to reach the destination. The advantage of using DSR is that it is beaconless and hence does not require periodic packet transmission and it performs well in the static network; in between nodes utilize the route cache information efficiently to reduce the control overhead.

2.3 Temporally Ordered Routing Algorithm (TORA):

The TORA [10] is a highly adaptive loop-free distributed routing algorithm based on the concept of link reversal .TORA is proposed to operate in a highly dynamic mobile networking environment. It is source-initiated and provides multiple routes for any desired source/destination pair. The key design concept of TORA is the localization of control messages to a very small set of nodes near the occurrence of a topological change. To accomplish this, nodes need to maintain routing information about adjacent (one-hop) nodes. The protocol performs three basic functions of Route creation, Route maintenance, and Route erasure. The first three elements collectively represent the reference level. A new reference level is defined each time a node loses its last downstream link due to a link failure. TORA’s route erasure phase essentially involves flooding a broadcast clear packet (CLR) throughout the network to erase invalid routes.

2.3 Destination Sequenced Distance Vector routing (DSDV):

In DSDV [7] protocol messages are exchanged between nearby mobile nodes. Routing updates may be triggered or routine. Updates are caused when routing information from one of the neighbors forces a change in the routing table. If there is a packet which the route to its destination is unknown it is cached while routing queries are sent out. The packets are cached until route replies are received from the destination. The buffer has a size and time limit for caching packets beyond which packets are dropped. All packets which have destination to the mobile node are routed directly by the address to its port. In the event that a target is not found, the packets are forwarded to the default target which is the routing agent. The routing agent designates the next hop for the packet and sends it down to the link layer.

3. ANALYSIS OF PROBLEM:

In Ad-hoc network node having limited power supply .it is the biggest challenge of an Ad-hoc network so if we want to increase the network lifetime (time duration when the first node of the network runs out of energy) as well the node lifetime then we must have an efficient energy management protocol. Most of the energy related study in MANET has been done to reduce energy consumption in either transmission or suggesting a different routing approach altogether but following the same concepts being used by standard routing protocols. We measured the energy consumption behavior of different routing protocols respectively the Destination Sequenced Distance Vector Routing (DSDV), Ad-hoc On Demand Distance Vector routing (AODV), Dynamic source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA).

4. ANALYSIS OF WORK:

The total energy consumed, including the energy consumed by the control packets, to transport one kilobyte of data to its destination [4]. This metric is minimum when the same number of bytes could be delivered at the destinations in fewer hops and with small number of control packets. The model presented in is used to estimate the send/receive energy of broadcasting or point-to-point mode of transmitting packets [7]. This metric is also referred to as energy expenditure. And various parameters A) MAC load B) Throughput C) Packet Delivery Ratio D) Energy Consumption per Packet. E) Remaining Battery Power.

A) MAC load: -the MAC load is the average number of MAC messages generated to each data packet successfully delivered to the destination.

B) Throughput: -Throughput is the number of packet successfully delivered to destination.

C) Energy Consumption per Packet: It is defined by the total energy consumption divided by the total number of packets received. This metric reflects the energy efficiency for each protocol.

D) Remaining Battery Power:

The number of nodes in the network versus the average remaining battery power is considered as the metric to analyze the performance of the protocols in terms of power.

These are the some parameters to described the our work here we study about in various network simulator based comparison on the basis of this parameter

Fig :-Average consumed Power and average reaming power using 30 nodes [1] [2]

Here we analysis the network simulator graph which show the power consumption over various MANET routing protocols, and this overview of power performances provides the aid of some key concepts how power performances of TORA will reach effectively for communication, we also study the different network simulator to identify the this weak communication is also gives the same result now we will find the some algorithms that help to improves the power consumption and long time communication .

5.PERFORMANCES TABLE:

	AODV	DSR	DSDV	TORA
MAC Load	The MAC load is	The MAC load is	The MAC load is	The MAC Load
	normal for AODV in all the time.	normal for DSR .In all the time.	normal for DSDV .In all the time.	increases rapidly when the number of nodes
				increases for TORA
				protocol
Throughput	Throughput of AODV	Throughput of DSR	Throughput of DSDV	Throughput of TORA
	protocol becoming stable when the number	protocol decreases When the number of	Increases rapidly when the nodes increase.	decreasing rapidly when the number of nodes
	of nodes increases.	nodes increase.		increases
Power	consumed power of	consumed power of	consumed power of	consumed power of
Consumption	networks using AODV decreases when the number of nodes increasing	networks using DSR decreases significantly when the number of nodes increasing	networks using DSDV stability with increasing number of nodes.	networks using TORA protocol increases rapidly.
Remaining	Increases the remaining	Increases the remaining	DSDV shows a gentle	Decreasing the
Battery	power when increases	power when increases	decrease when	remaining power when
Power	nodes.	nodes.	increasing number of	increases nodes.
			nodes

6. CONCLUSION:

In this paper we analysis ad-hoc routing protocols in different network environment. Overall study shows that the energy consumption and throughput and minimum power consumption routing methods in small size networks did not show any significant differences. However, for medium and large ad-hoc networks the TORA performance proved to be normal power effective on large network and better for small area, in this paper and other routing protocols are less effective in small size network and large network it significantly improves. After analysis routing protocols on ns simulator we described our work on another simulation tool to explore the energy based analysis and how to improve the TORA protocols performances on the power consumption.

7. REFRENCES:

1. Ashish Kumar ”Performance Evaluation of Energy Consumption in MANET” International Journal of Computer Applications (0975 – 8887) Volume 42– No.2, March 2012 [2].

2. Patil V.P. “Reactive and Proactive Routing Protocol Energy Efficiency Performance Analysis in Wireless Ad Hoc Networks” IJECSE,Volume1,Number 4 ,pp 233-238 Apr

3. J. Broch, D. A. Maltz, D. B. Johnson, Y-C. Hu, and J. Jetcheva. “A performance comparison of multi-hop wireless ad hoc networks.” In Proceedings of the 4th Int. Conference on Mobile Computing and Networking (ACM MOBICOM’10), pp. 85-97, October 2010.

4. S.-L. Wu and P.-C. Tseng, “An Energy Efficient MAC Protocol for IEEE 802.11 WLANs,” in IEEE CNSR’04, May 2004.

5. Lijuan Cao Teresa Dahlberg Yu Wang “Performance
Evaluation of Energy Efficient Ad Hoc Routing Protocols”

6. A. Srinivas and E. Modiano, “Minimum energy disjoint
path routing in wireless ad-hoc networks,” in MobiCom ’03: Proceedings of the 9^th Annual International Conference on Mobile Computing and Networking. New York, NY, USA:
ACM Press, 2003, pp. 122–133.

7. DSDV RFC www..ietf.org/rfc/rfc6126.txt retrieves as on
5/01/2013.

8. AODV RFC www..ietf.org/rfc/rfc3561.txt. retrieves as on
5/01/2013

9. DSR RFC www..ietf.org/rfc/rfc4728.txt. retrieves as on
5/01/2013

10. TORA RFC www..ietf.org/rfc/rfc1119.txt. retrieves as on
5/01/2013

11. V. Kanakaris, D. Ndzi and D. Azzi ” Ad-hoc Networks
Energy Consumption: A review of the Ad-Hoc Routing
Protocols” Journal of Engineering Science and Technology
Review 3 (1) (2010) 162-167.

12. P. Sivasankar, C. Chellappan “Optimised Energy
Efficient Routing Protocols and their Performance
Comparison for MANET” European Journal of Scientific
Research ISSN 1450-216X Vol. 90 No 1 November, 2012,
pp.136-148.

Received on 19.02.20123 Accepted on 04.03.2013

Research J. Science and Tech 5(3): July- Sept., 2013 page 303-306